package leetcode.sort;

import leetcode.sort.common.SortUtils;

import java.util.Arrays;

class Solution1337 {
    public int[] kWeakestRows(int[][] mat, int k) {
        return SortUtils.kWeakestRows(mat, k);
    }
}

public class leetcode1337 {
    public static void main(String[] args) {
        Solution1337 solution1337 = new Solution1337();
        int[][] mat = {
                {1, 1, 0, 0, 0},
                {1, 1, 1, 1, 0},
                {1, 0, 0, 0, 0},
                {1, 1, 0, 0, 0},
                {1, 1, 1, 1, 1}
        };
        System.out.println(Arrays.toString(solution1337.kWeakestRows(mat, 3)));
    }
}
